Ascending subgraph decompositions of regular graphs
نویسندگان
چکیده
منابع مشابه
Ascending subgraph decompositions of regular graphs
We prove that every regular graph with ( n+1 2 ) + t edges, 06 t ¡ n + 1, can be decomposed into n subgraphs G1; G2; : : : ; Gn such that |E(Gi)| = i and Gi 6Gi+1 for i = 1; 2; : : : ; n − 1 and |E(Gn)|= n+ t. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملCompatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition C of G is compatible with T if no pair of adjacent edges of G is both a transition of T and consecutive in a circuit of C. We give a conjectured characterization of when a 4-regular graph has a transition system which...
متن کاملA result on decompositions of regular graphs
Su, X.-Y., A result on decompositions of regular graphs, Discrete Mathematics 105 (1992) 323-326. We prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that x(H) = x(G) and o(H) = w(G), where x and w are the chromatic number and the clique number, respectively...
متن کاملCp-decompositions of some regular graphs
In this paper, for any prime p 11, we consider Cp-decompositions of Km × Kn and Km ∗ Kn and also Cp-factorizations of Km × Kn, where × and ∗ denote the tensor product and wreath product of graphs, respectively, (Km ∗ Kn is isomorphic to the complete m-partite graph in which each partite set has exactly n vertices). It has been proved that for m, n 3, Cp-decomposes Km ×Kn if and only if (1) eith...
متن کاملHamiltonian decompositions of random bipartite regular graphs
We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00445-9